Interest-Based RDF Update Propagation
نویسندگان
چکیده
Many LOD datasets, such as DBpedia and LinkedGeoData, are voluminous and process large amounts of requests from diverse applications. Many data products and services rely on full or partial local LOD replications to ensure faster querying and processing. While such replicas enhance the flexibility of information sharing and integration infrastructures, they also introduce data duplication with all the associated undesirable consequences. Given the evolving nature of the original and authoritative datasets, to ensure consistent and up-to-date replicas frequent replacements are required at a great cost. In this paper, we introduce an approach for interest-based RDF update propagation, which propagates only interesting parts of updates from the source to the target dataset. Effectively, this enables remote applications to ‘subscribe’ to relevant datasets and consistently reflect the necessary changes locally without the need to frequently replace the entire dataset (or a relevant subset). Our approach is based on a formal definition for graphpattern-based interest expressions that is used to filter interesting parts of updates from the source. We implement the approach in the iRap framework and perform a comprehensive evaluation based on DBpedia Live updates, to confirm the validity and value of our approach.
منابع مشابه
iRap - an Interest-Based RDF Update Propagation Framework
We present the iRap (interest-based RDF update propagation) framework that propagates only relevant parts of updates published by a source dataset to a local replica excerpt of the source dataset. This interest-based update propagation enables remote applications to ‘subscribe’ to relevant datasets and consistently reflect the necessary changes locally without the need to frequently replace the...
متن کاملRUL: a Declarative Language for Updating RDF Data Master’s Thesis
Semantic Web applications are striving nowadays for managing changes of persistent resource descriptions created according to RDFS schemata. To cope with this demands, a declarative update language for RDF graphs is proposed, which is based on the paradigms of query and view languages RQL and RVL. This language, called RUL, ensures that the execution of the update primitives on nodes and arcs n...
متن کاملRUL: A Declarative Update Language for RDF
We propose a declarative update language for RDF graphs which is based on the paradigms of query and view languages RQL and RVL. Our language, called RUL, ensures that the execution of the update primitives on nodes and arcs neither violates the semantics of the RDF model nor the semantics of the given RDFS schema. In addition, RUL supports fine-grained updates at the class and property instanc...
متن کاملPerformance Modelling and Evaluation of Event-Condition-Action Rules on RDF in P2P networks
This paper studies the performance and scalability aspects of processing Event-ConditionAction (ECA) rules on RDF metadata in peer-to-peer (P2P) environments. This work has been motivated by the increasing use of RDF in distributed web-based applications that require timely notification and propagation of metadata changes between peers, for which ECA rules are a possible candidate technology. W...
متن کاملControlling View Divergence of Data Freshness in a Replicated Database System Using Statistical Update Delay Estimation
We propose a method of controlling the view divergence of data freshness when copies of sites in a replicated database are updated asynchronously. The view divergence of the replicated data freshness is the difference in the recentness of the updates reflected in the data acquired by clients. Our method accesses multiple sites and provides a client with data that reflects all the updates receiv...
متن کامل